No-Idle Flowshop Scheduling for Energy-Efficient Production: An Improved Optimization Framework

نویسندگان

چکیده

Production environment in modern industries, like integrated circuits manufacturing, fiberglass processing, steelmaking, and ceramic frit, is characterized by zero idle-time between inbound outbound jobs on every machine; this technical requirement improves energy efficiency, hence, has implications for cleaner production other situations. An exhaustive review of literature first conducted to shed light the development no-idle flowshops. Considering intractable nature problem, research also develops an extended solution method optimizing Bi-objective No-Idle Permutation Flowshop Scheduling Problem (BNIPFSP). Extensive numerical tests statistical analysis are evaluate developed method, comparing it with best-performing algorithm solve BNIPFSP. Overall, proposed extension outperforms terms quality at expense a longer computational time. This concluded providing suggestions future understudied scheduling extension.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

No-wait flexible flowshop scheduling with no-idle machines

This paper considers a two-stage flexible flowshop scheduling problem with no waiting time between two sequential operations of a job and no idle time between two consecutive processed jobs on machines of the second stage. We show its complexity and present a heuristic algorithm with asymptotically tight error bounds. © 2004 Elsevier B.V. All rights reserved.

متن کامل

An improved heuristic for permutation flowshop scheduling

Flowshop scheduling deals with determination of optimum sequence of jobs to be processed on some machines in a fixed order so as to satisfy certain scheduling criteria. The general problem of scheduling has been shown to be NP-complete. Exact algorithms, such as integer programming and branch-and-bound, guarantee optimality but do not yield the optimum solution in polynomial time even for probl...

متن کامل

An improved genetic algorithm for multidimensional optimization of precedence-constrained production planning and scheduling

Integration of production planning and scheduling is a class of problems commonly found in manufacturing industry. This class of problems associated with precedence constraint has been previously modeled and optimized by the authors, in which, it requires a multidimensional optimization at the same time: what to make, how many to make, where to make and the order to make. It is a combinatorial,...

متن کامل

Diversified Particle Swarm Optimization for Hybrid Flowshop Scheduling

The aim of this paper is to propose a new particle swarm optimization algorithm to solve a hybrid flowshop scheduling with sequence-dependent setup times problem, which is of great importance in the industrial context. This algorithm is called diversified particle swarm optimization algorithm which is a generalization of particle swarm optimization algorithm and inspired by an anarchic society ...

متن کامل

Flowshop Scheduling with Respect to Machine Idle Times

We consider a variant of no-wait flowshop scheduling that is motivated by continuous casting in the multistage production process in steel manufacturing. The task is to find a feasible schedule with a minimum number of interruptions, i.e., continuous idle time intervals on the last production stage. Based on an interpretation as Eulerian Extension Problems, we fully settle the complexity status...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Mathematics

سال: 2021

ISSN: ['2227-7390']

DOI: https://doi.org/10.3390/math9121335